منابع مشابه
Covering Regular Graphs
A covering projection from a graph G onto a graph H is a \local isomorphism": a mapping from the vertex set of G onto the vertex set of H such that, for every v 2 V (G), the neighborhood of v is mapped bijectively onto the neighborhood (in H) of the image of v. We investigate two concepts that concern graph covers of regular graphs. The rst one is called \multicovers": we show that for any regu...
متن کاملCovering regular graphs with forests of small trees
A (d, k) -forest is a forest consisting of trees whose diameters are at most d and whose maximum vertex degree ,6. is at most k. The (d, k)-arboricity of a graph G is the minimum number of (d, k}-forests needed to cover E(G). This concept is a common generalization of linear k-arboricity and star arboricity. Using a probabilistic approach developed recently for linear karboricity, we obtain an ...
متن کاملCovering Graphs: The Covering Problem Solved
For every fixed graph H, we determine the H-covering number of Kn, for all n > n0(H). We prove that if h is the number of edges of H, and gcd(H) = d is the greatest common divisor of the degrees of H, then there exists n0 = n0(H), such that for all n > n0, C(H,Kn) = d dn 2h dn− 1 d ee, unless d is even, n = 1 mod d and n(n− 1)/d+ 1 = 0 mod (2h/d), in which case C(H,Kn) = d ( n 2 ) h e+ 1. Our m...
متن کاملPlanar Cycle Covering Graphs
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every face of a planar embedding of the graph in order to capture the effect of unary potentials. A ground state of the resulting approximation can be computed efficiently by reduction to minimum-weight perfect matching. We ...
متن کاملMultiple Kronecker covering graphs
A graph may be the Kronecker cover in more than one way. In this note we explore this phenomenon. Using this approach we show that the least common cover of two graphs need not be unique.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1997
ISSN: 0095-8956
DOI: 10.1006/jctb.1996.1743